Spontaneous Resonances and the Coherent States of the Queuing Networks
نویسندگان
چکیده
We present an example of a highly connected closed network of servers, where the time correlations do not go to zero in the infinite volume limit. This phenomenon is similar to the continuous symmetry breaking at low temperatures in statistical mechanics. The role of the inverse temperature is played by the average load.
منابع مشابه
Entanglement of an Atom and Its Spontaneous Emission Fields via Spontaneously Generated Coherence
The entanglement between a ?-type three-level atom and its spontaneous emission fields is investigated. The effect of spontaneously generated coherence (SGC) on entanglement between the atom and its spontaneous emission fields is then discussed. We find that in the presence of SGC the entanglement between the atom and its spontaneous emission fields is completely phase dependent, while in absen...
متن کاملبرهمنهی حالتهای همدوس غیرخطی روی سطح کره
In this paper, by using the nonlinear coherent states on a sphere, we introduce superposition of the aforementioned coherent states. Then, we consider quantum optical properties of these new superposed states and compare these properties with the corresponding properties of the nonlinear coherent states on the sphere. Specifically, we investigate their characteristics function, photon-number d...
متن کاملAn Entanglement Study of Superposition of Qutrit Spin-Coherent States
Considering generalized concurrence as the criterion of entanglement, we study entanglement properties of superposition of two qutrit coherent states, as a function of their amplitudes. These states may attain maximum entanglement or no entanglement at all, depending on the choice of the parameters involved. The states revealing maximum entanglement also display the maximum violations of the Be...
متن کاملLongest Path in Networks of Queues in the Steady-State
Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...
متن کامل